合成分队双层主从决策模型研究

针对合成分队不同指挥层级之间的决策交互优化问题,提出了基于主从决策的双层武器目标分配模型。该模型能够体现上下指挥层级之间交互式决策协调优化的特点:上层目标为主攻方向我方遭受威胁最小,下层目标为对敌打击最大。结合合成分队作战决策的特点和要求,提出了一种求解该模型的改进型粒子群优化算法。仿真结果表明,该模型合理有效,改进的求解算法能够获得满意解。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Application of Markov renewal theory and semi-Markov decision processes in maintenance modeling and optimization of multi-unit systems

In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory.     

公安高校计算机基础课程关联性分析

对＂1＋X＂双层课程体系下的计算机基础课程之间的关联性进行初步分析,揭示了教学目标一致性、教学内容互相渗透、人才培养逐层连续性等特点。     

国外火炮定位雷达的现状和发展趋势

主要描述了国外火炮定位雷达的研制现状,对美国研制的Firefinder系列雷达,俄罗斯研制的Zoopark-1雷达,英、法、德等国联合研制的COBRA雷达以及瑞典和挪威联合研制的AR THUR雷达等几种火炮定位雷达的特点、主要技术指标及市场销售情况做了简要的介绍,最后总结了国外火炮定位雷达的最新发展趋势。     

基于不确定性理论的研制技术风险评估方法研究

分析了装备研制技术风险的含义,根据技术风险的特点建立了评价技术风险的指标体系。在技术风险度量中引入不确定性理论的概念,并建立了基于不确定性的技术风险的度量方法,对综合技术风险进行评价。最后通过实例验证了综合评价方法的可用性。     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

陆军诸兵种合同作战兰切斯特方程的弹药消耗预测研究

描述了诸兵种合同作战的兰切斯特方程及其矩阵解,提出了一种通过兵力损耗换算弹药损耗的新思路,分析和确定了用该方法预测弹药消耗的相关参数,最后运用Matlab进行仿真计算,预测出了武器装备战损情况和弹药消耗情况。     

关于加强“4＋1”模式学员军事素质基础培养的研究

现代战争对军人的军事素质提出了更高的要求,而优良的军事素质,是靠平时严格、艰苦的训练来实现的.我院高度重视培养提高学员的军事素质,主要通过3个途径实现培养目标.这里重点阐述了我院对学员军事素质培养的实践经验及效果,对军事工程院校学员军事素质基础的提高,具有一定的指导作用和参考价值.     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011